Extending the Lambda Calculus to Express Randomized and Quantumized Algorithms
نویسنده
چکیده
This paper introduces a formal metalanguage called the lambda-q calculus for the specification of quantum programming languages. This metalanguage is an extension of the lambda calculus, which provides a formal setting for the specification of classical programming languages. As an intermediary step, we introduce a formal metalanguage called the lambdap calculus for the specification of programming languages that allow true random number generation. We demonstrate how selected randomized algorithms can be programmed directly in the lambda-p calculus. We also demonstrate how satisfiability can be solved in the lambda-q calculus.
منابع مشابه
Programming complex systems
Classical programming languages cannot model essential elements of complex systems such as true random number generation. This paper develops a formal programming language called the lambda-q calculus that addresses the fundamental properties of complex systems. This formal language allows the expression of quantumized algorithms, which are extensions of randomized algorithms in that probabilit...
متن کاملEmbedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calculus modulo. We show in this paper that this simple extension is surprisingly expressive and, in particular, that all functional Pure Type Systems, such as the system F, or the Calculus of Constructions, can be embedde...
متن کاملIJESRT INTERNATIONAL JOURNA Deconstructing Evolutionary Programming
only by the understanding of randomized algorithms, but also by of lambda calculus. We describe new game had it tomata, the ve occurred. -over-IP, which -voting ternet theory. plications, tenet of
متن کاملArrays in Imperative Lambda Calculus
In recent work, we defined a formal system called Imperative Lambda Calculus to provide clean integration of functional and imperative programming styles. In this paper, we study the issues of array manipulation in this framework. It is shown that the unique features of the calculus allow one to express array algorithms using high-level abstractions that are not available in purely functional l...
متن کاملArrays in Imperative Lambda
In recent work, Swarup, Reddy, and Ireland deened a formal system called Imperative Lambda Calculus to provide clean integration of functional and imperative programming styles. In this paper, we study the issues of array manipulation in this framework. It is shown that the unique features of the calculus allow one to express array algorithms using high-level abstractions that are not available...
متن کامل